#include<iostream>
using namespace std;
void Fun(BinTree* T)
{
	if (T != NULL)
	{
		BinTree* p;
		Stack s;
		Init_Stack(&s);
		Push_Stack(&s, T);
		while (!Empty_Stack(s))
		{
			Get_Stack(&s, &p);
			Pop_Stack(&s);
			cout << p->data;
			if (p->rchild) {
				Push_Stack(&s, p->rchild);
			}
			if (p->lchild) {
				Push_Stack(&s, p->lchild);
			}
		}
	}
	
}